quantifier-free formula

См. также в других словарях:

• Quantifier elimination — is a technique in mathematical logic, model theory, and theoretical computer science.We say that a given theory has quantifier elimination if for every sentence with quantification there exists an equivalent (modulo the theory) sentence without… …   Wikipedia

• Formula (mathematical logic) — In mathematical logic, a formula is a type of abstract object a token of which is a symbol or string of symbols which may be interpreted as any meaningful unit (i.e. a name, an adjective, a proposition, a phrase, a string of names, a string of… …   Wikipedia

• Formula 1 — Formule 1 Pour les articles homonymes, voir F1 (homonymie). Formule 1 …   Wikipédia en Français

• quantifier — Informally, a quantifier is an expression that reports a quantity of times that a predicate is satisfied in some class of things (i.e. in a ‘domain’). Thus, thinking about a class of children and their diets, one might report that some eat cake,… …   Philosophy dictionary

• Bounded quantifier — In the study of formal theories in mathematical logic, bounded quantifiers are often added to a language. These are two quantifiers in addition to forall and exists. They are motivated by the fact that determining whether a sentence with only… …   Wikipedia

• True quantified Boolean formula — The language TQBF is a formal language in computer science that contains True Quantified Boolean Formulas. A fully quantified boolean formula is a formula in first order logic where every variable is quantified (or bound), using either… …   Wikipedia

• Lindström quantifier — In mathematical logic, a Lindström quantifier is a generalized polyadic quantifier. They are a generalization of first order quantifiers, such as the existential quantifier, the universal quantifier, and the counting quantifiers.They were… …   Wikipedia

• Conditional quantifier — In logic, a conditional quantifier is a kind of Lindström quantifier (or generalized quantifier) QA that, relative to a classical model A, satisfies some or all of the following conditions ( X and Y range over arbitrary formulas in one free… …   Wikipedia

• Dialectica interpretation — In proof theory, the Dialectica interpretation [1] is a proof interpretation of intuitionistic arithmetic (Heyting arithmetic) into a finite type extension of primitive recursive arithmetic, the so called System T. It was developed by Kurt Gödel… …   Wikipedia

• Gentzen's consistency proof — Gentzen s theoremIn 1936 Gerhard Gentzen proved the consistency of first order arithmetic using combinatorial methods. Gentzen s proof shows much more than merely that first order arithmetic is consistent. Gentzen showed that the consistency of… …   Wikipedia

• Post's theorem — In computability theory Post s theorem, named after Emil Post, describes the connection between the arithmetical hierarchy and the Turing degrees. Background The statement of Post s theorem requires several concepts relating to definability and… …   Wikipedia